Recombinations of Busy Beaver Machines
نویسنده
چکیده
Many programmers belive that Turing-based machines cannot think. We also believe in this, however it is interesting to note that the most sophisticated machines are not programmed by human beings. We have only discovered them. In this paper, using well-known Busy Beaver and Placid Platypus machines, we generate further very similar, but not exactly the same machines. We have found a recombinated BB5 machine which can make 70.740.809 steps before halting.
منابع مشابه
Attacking the Busy Beaver 5
Since T. Rado in 1962 defined the busy beaver game several approaches have used computer technology to search busy beavers or even compute special values of Σ. Σ(5) is not yet known. A new approach to the computation of Σ(5) is presented, together with preliminary results, especially Σ(5)≥4098. This approach includes techniques to reduce the number of inspected Turing machines, to accelerate si...
متن کاملDynamical systems approach to the Busy Beaver problem
The purpose of this paper is to reconsider the Busy Beaver problem, which is a modification of the Turing machine’s halting problem, in the light of a dynamical systems approach. Numerical experiments show that the spatio-temporal patterns of machines can be roughly classified into four types. In particular, well-regulated and self-similar patterns are found in most longer-lived machines, which...
متن کاملGenerating Candidate Busy Beaver Machines (Or How to Build the Zany Zoo)
The busy beaver problem is a well-known example of a non-computable function. In order to determine a particular value of this function, it is necessary to generate and classify a large number of Turing machines. Previous work on this problem has described the processes used for the generation and classification of these machines, but unfortunately has generally not provided details of the mach...
متن کاملHolkner. Acceleration Techniques for Busy Beaver Candidates ACCELERATION TECHNIQUES FOR BUSY BEAVER CANDIDATES
ABSTRACT: A busy beaver is a Turing machine of N states which, given a blank tape, halts with an equal or higher number of printed symbols than all other machines of N states. Candidates for this class of Turing machine cannot realistically be run on a traditional simulator due to their high demands on memory and time. This paper describes some techniques that can be used to run these machines ...
متن کاملBusy Beaver – An Evolutionary Approach
The Busy Beaver is an interesting theoretical problem proposed by Tibor Rado in 1962. Since then, it has attracted the attention of many researchers and several contests were organised trying to produce good solutions. In this paper, we propose an evolutionary approach to the problem. Our experimental results prove that this technique is very effective in attacking Busy Beaver, since we were ab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0908.4013 شماره
صفحات -
تاریخ انتشار 2009